Successive cancellation decoding of polar codes using new hybrid processing element
نویسندگان
چکیده
Polar codes are one of the best linear block that capacity achieving and incorporating along with it a simplified encoding decoding routines. Successive cancellation (SC) algorithm is predominantly used algorithms due to its low complexity. It has broad scopes for hardware architecture design reformulation. For polar code, trade-off among long latency silicon area SC bottleneck high throughput decoder. The available prior decoder designs have higher requirements length. This paper introduces unique reformulation processing element (PE) decoding. proposed leads two benefits: firstly, critical path complexity PE meaningfully reduced by using unified adder block. Secondly, requirement power consumption were also considerably without any loss in performance. build various lengths. Moreover, Gate-level analysis revealed attains an 18% reduction 38% over conventional similar
منابع مشابه
Study on Successive Cancellation Decoding of Polar Codes
Thanks to the property of provably capacityachieving, the recently-discovered polar codes are being taken many attentions. The Successive Cancellation (SC) is the first and widely known decoding for polar codes. In the paper, we study the decoding beginning with its recursive formula. Compared with previous works, our study is more strict and many fresh results are presented which would be help...
متن کاملCapacity-Achievability of Polar Codes under Successive Cancellation List Decoding
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...
متن کاملPartitioned Successive-Cancellation Flip Decoding of Polar Codes
Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre errorcorrection performance at moderate code length. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List dec...
متن کاملImproved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution
Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for 5 generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to o...
متن کاملJoint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels
Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and conventional decoding methods. To deal with the ISI problem, in this paper a new joint successive cancellation (SC) decoding algorithm is proposed for polar c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Reconfigurable & Embedded Systems (IJRES)
سال: 2022
ISSN: ['2089-4864', '2722-2608']
DOI: https://doi.org/10.11591/ijres.v11.i2.pp157-165